The energy of the Mycielskian of a regular graph

نویسندگان

  • R. Balakrishnan
  • T. Kavaskar
  • Wasin So
چکیده

Let G be a finite connected simple graph and μ(G) be the Mycielskian of G. We show that for connected graphs G and H, μ(G) is isomorphic to μ(H) if and only if G is isomorphic to H. Furthermore, we determine the energy of the Mycielskian of a connected regular graph G in terms of the energy E(G) of G, where the energy of G is the sum of the absolute values of the eigenvalues of G. The energy of a graph has its origin in chemistry in that the energy of a conjugated hydrocarbon molecule computed using the Hückel theory in quantum chemistry coincides with the graph energy of the corresponding molecular graph. We show that if G is a regular graph of order n with E(G) > 3n, then μ(G) is hyperenergetic. 164 R. BALAKRISHNAN, T. KAVASKAR AND W. SO Figure 1: μ(K1,3 + e)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

On the Regular Power Graph on the Conjugacy Classes of Finite Groups

emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.

متن کامل

Degree distance index of the Mycielskian and its complement

In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.

متن کامل

Calculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )

By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2012